Graph automorphism

Results: 31



#Item
11

PDF Document

Add to Reading List

Source URL: www.math.sinica.edu.tw

Language: English - Date: 2003-10-08 02:41:27
121 Asia Pacific Mathematics Newsletter ShortIntroduction Introduction to AAShort

1 Asia Pacific Mathematics Newsletter ShortIntroduction Introduction to AAShort

Add to Reading List

Source URL: www.asiapacific-mathnews.com

Language: English - Date: 2013-02-06 22:33:54
13ASSEMBLING HOMOLOGY CLASSES IN AUTOMORPHISM GROUPS OF FREE GROUPS JAMES CONANT, ALLEN HATCHER, MARTIN KASSABOV, AND KAREN VOGTMANN Abstract. The observation that a graph of rank n can be assembled from graphs of smaller

ASSEMBLING HOMOLOGY CLASSES IN AUTOMORPHISM GROUPS OF FREE GROUPS JAMES CONANT, ALLEN HATCHER, MARTIN KASSABOV, AND KAREN VOGTMANN Abstract. The observation that a graph of rank n can be assembled from graphs of smaller

Add to Reading List

Source URL: www.math.cornell.edu

Language: English - Date: 2015-04-24 15:07:19
14Diskrete Mathematik April ’06  EXPANDER GRAPHS - ARE THERE ANY MYSTERIES LEFT?  NATI LINIAL

Diskrete Mathematik April ’06 EXPANDER GRAPHS - ARE THERE ANY MYSTERIES LEFT? NATI LINIAL

Add to Reading List

Source URL: www.cs.huji.ac.il

Language: English - Date: 2006-04-16 02:53:26
15Technical Report  Graph Isomorphism Implementation in LEDA 5.1 Author: Johannes Singler

Technical Report Graph Isomorphism Implementation in LEDA 5.1 Author: Johannes Singler

Add to Reading List

Source URL: www.algorithmic-solutions.de

Language: English - Date: 2008-01-10 18:04:28
16Approximate Axial Symmetries from Continuous Time Quantum Walks Luca Rossi1 , Andrea Torsello1 , and Edwin R. Hancock2 1  Department of Environmental Science, Informatics and Statistics,

Approximate Axial Symmetries from Continuous Time Quantum Walks Luca Rossi1 , Andrea Torsello1 , and Edwin R. Hancock2 1 Department of Environmental Science, Informatics and Statistics,

Add to Reading List

Source URL: www.cs.bham.ac.uk

Language: English - Date: 2015-03-30 09:05:14
17Contemporary Mathematics  McKay’s Canonical Graph Labeling Algorithm Stephen G. Hartke and A. J. Radcliffe  Abstract. The problem of deciding whether two graphs are isomorphic is

Contemporary Mathematics McKay’s Canonical Graph Labeling Algorithm Stephen G. Hartke and A. J. Radcliffe Abstract. The problem of deciding whether two graphs are isomorphic is

Add to Reading List

Source URL: www.math.unl.edu

Language: English - Date: 2010-10-03 21:27:06
18THEOREM OF THE DAY Theorem (Cameron, 1982) For any integer k > 2 there exist only finitely many distance-transitive kregular graphs. The Biggs-Smith graph is the largest distance-transitive graph that is 3-regular (every

THEOREM OF THE DAY Theorem (Cameron, 1982) For any integer k > 2 there exist only finitely many distance-transitive kregular graphs. The Biggs-Smith graph is the largest distance-transitive graph that is 3-regular (every

Add to Reading List

Source URL: www.theoremoftheday.org

Language: English - Date: 2014-02-07 05:07:16
19nauty and Traces User’s Guide (Version 2.5) Brendan D. McKay∗ Adolfo Piperno  Research School of Computer Science

nauty and Traces User’s Guide (Version 2.5) Brendan D. McKay∗ Adolfo Piperno Research School of Computer Science

Add to Reading List

Source URL: cs.anu.edu.au

Language: English - Date: 2013-01-19 10:05:25
20Random Orderings and Unique Ergodicity of Automorphism Groups Omer Angel∗, Alexander S. Kechris†, and Russell Lyons‡ 19 November[removed]Abstract

Random Orderings and Unique Ergodicity of Automorphism Groups Omer Angel∗, Alexander S. Kechris†, and Russell Lyons‡ 19 November[removed]Abstract

Add to Reading List

Source URL: math.caltech.edu

Language: English - Date: 2012-11-19 12:56:06